Search Results
Spectral Bounds and SDP Hierarchies for Geometric Packing Problems
Philippe Moustrou - "Exact semidefinite programming bounds for packing problems" | CGD III
Yuehaw Khoo -- Clique-Based Semidefinite Relaxation of the Quadratic Assignment Problem
Geometry of Life - Part 4
Optimization for lattices, packings, and coverings (Part 2) - Frank Vallentin
Packing Spheres Efficiently and Learning how to Kiss in each Dimension - Dr. Stephanie Vance
The moment-SOS hierarchy – Jean Lasserre – ICM2018
GIS: Packing polygons without intersection and empty places
Positive Semidefinite Rank
Lower bounds on the size of semidefinite programming relaxations - Steurer
An Introduction to Binary Code Bounds - Fernando Granha Jeronimo
C3.B — Polytopes, lattices, and spherical codes for the nearest neighbor problem
